Linear Extensions of N-free Orders
نویسندگان
چکیده
منابع مشابه
Linear Extensions of N-free Orders
We consider the number of linear extensions of an N-free order P . We give upper and lower bounds on this number in terms of parameters of the corresponding arc diagram. We propose a dynamic programming algorithm to calculate the number. The algorithm is polynomial if a new parameter called activity is bounded by a constant. The activity can be bounded in terms of parameters of the arc diagram....
متن کاملAggregate Functions, Conservative Extensions, and Linear Orders
1 Summary Practical database query languages are usually equipped with some aggregate functions. For example, \\nd mean of column" can be expressed in SQL. However, the manner in which aggregate functions were introduced in these query languages leaves something to be desired. Breazu-Tannen, Buneman, and Wong 3] introduced a nested relational language NRC(=) based on monads 16, 24] and structur...
متن کاملLinear Extensions of Orders Invariant under Abelian Group Actions
Let G be an abelian group acting on a set X, and suppose that no element of G has any finite orbit of size greater than one. We show that every partial order on X invariant under G extends to a linear order on X also invariant under G. We then discuss extensions to linear preorders when the orbit condition is not met, and show that for any abelian group acting on a set X, there is a G-invariant...
متن کاملOn Unimodality for Linear Extensions of Partial Orders
R. Rivest has recently proposed the following intriguing conjecture: Let x* denote an arbitrary fixed element in an n-element partially ordered set P, and for each k in {1, 2, , n let Nk be the number of order-preserving maps from P onto {1, 2,..., n} that map x* into k. Then the sequence N1,'' ', N,, is unimodal. This note proves the conjecture for the special case in which P can be covered by...
متن کاملLinear extensions of partial orders and reverse mathematics
We introduce the notion of τ -like partial order, where τ is one of the linear order types ω, ω∗, ω + ω∗, and ζ. For example, being ω-like means that every element has finitely many predecessors, while being ζ-like means that every interval is finite. We consider statements of the form “any τ -like partial order has a τ -like linear extension” and “any τ -like partial order is embeddable into τ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Order
سال: 2014
ISSN: 0167-8094,1572-9273
DOI: 10.1007/s11083-014-9321-0